Inductive Data Types: Well-ordering Types Revisited
نویسندگان
چکیده
We consider Martin-Löf’s well-ordering type constructor in the context of an impredicative type theory. We show that the well-ordering types can represent various inductive types faithfully in the presence of the filling-up equality rules or η-rules. We also discuss various properties of the filling-up rules. ! " ! # $ % &" '( ) '* + '' + ,. '' " ''/0 % &..'1 " '2 34",5 6 ,5/0 7 % ! 0 " ! # &" '(/ 8 ! " ! # $ % &+ ''/0 9 % 0 : ; % 0 : < ; % 0 = 9 > ! % " ! # $ &?4@,5/0; ! A= $ % -1 &?4@,5/ B B0 7 ! C 9 ) ! Æ % 0 % ! 0 ! )
منابع مشابه
The Well-Founded Semantics Is the Principle of Inductive Definition, Revisited
In the past, there have been several attempts to explain logic programming under the well-founded semantics as a logic of inductive definitions. A weakness in all is the absence of an obvious connection between how we understand various types of informal inductive definitions in mathematical text and the complex mathematics of the well-founded semantics. In this paper, we close this gap. We for...
متن کاملTermination of Algorithms over Non-freely Generated Data Types
Termination proofs for recursively deened operations serve several purposes: On the one hand, of course, they ensure the termination of the respective algorithms which is an essential topic in software veri-cation. On the other hand, a successful termination proof allows to use the termination ordering as an induction ordering for future inductive proofs. So far, in the area of explicit inducti...
متن کاملAutomation for Dependently Typed Functional Programming
Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is difficult in current system due to lack of proof automation. We identify and discuss proof patterns that occur when programming with dependent types and detail how the automation of such patterns allow us to work more comfortably w...
متن کاملWander Types A Formalization of Coinduction - Recursion ∗
Wander types are a coinductive version of inductive-recursive definitions. They are defined by simultaneously specifying the constructors of the type and a function on the type itself. The types of the constructors can refer to the function component and the function itself is given by pattern matching on the constructors. Wander types are different from inductive-recursive types in two ways: t...
متن کاملWander types : A formalization of coinduction - recursion ∗
Wander types are a coinductive version of inductive-recursive definitions. They are defined by simultaneously specifying the constructors of the type and a function on the type itself. The types of the constructors can refer to the function component and the function itself is given by pattern matching on the constructors. Wander types are different from inductive-recursive types in two ways: t...
متن کامل